Conjugate-Gradient Preconditioning Methods: Numerical Results
نویسنده
چکیده
منابع مشابه
Numerical Methods to Solve 2-D and 3-D Elliptic Partial Differential Equations Using Matlab on the Cluster maya
Discretizing the elliptic Poisson equation with homogeneous Dirichlet boundary conditions by the finite difference method results in a system of linear equations with a large, sparse, highly structured system matrix. It is a classical test problem for comparing the performance of direct and iterative linear solvers. We compare in this report Gaussian elimination applied to a dense system matrix...
متن کاملParallel Finite Element Approximate Inverse Preconditioning on Symmetric Multiprocessor Systems
Parallel normalized preconditioned conjugate gradient type methods based on normalized approximate finite element inverse matrix techniques are investigated for the efficient solution of sparse linear systems. Application of the proposed methods on a three dimensional boundary value problems is discussed and numerical results are given. The parallel implementation of the normalized precondition...
متن کاملA New Hybrid Conjugate Gradient Method Based on Eigenvalue Analysis for Unconstrained Optimization Problems
In this paper, two extended three-term conjugate gradient methods based on the Liu-Storey ({tt LS}) conjugate gradient method are presented to solve unconstrained optimization problems. A remarkable property of the proposed methods is that the search direction always satisfies the sufficient descent condition independent of line search method, based on eigenvalue analysis. The globa...
متن کاملPreconditioning CGNE iteration for inverse problems
The conjugate gradient method applied to the normal equations (cgne) is known as one of the most efficient methods for the solution of (non-symmetric) linear equations. By stopping the iteration according to a discrepancy principle, cgne can be turned into a regularization method. We show that cgne can be accelerated by preconditioning in Hilbert scales, derive (optimal) convergence rates with ...
متن کاملAn Efficient Deflation Technique for the Communication- Avoiding Conjugate Gradient Method
Communication-avoiding Krylov subspace methods (CA-KSMs) fuse s loop iterations in order to asymptotically reduce sequential and parallel communication costs by a factor of O(s). However, the actual savings depend on the nonzero structure of the system matrix A, and these savings typically diminish as A fills, as is common when preconditioning. Recent efforts target incorporating preconditionin...
متن کامل